Integer factorization as subset-sum problem

This paper elaborates on a sieving technique that has first been applied in 2018 for improving bounds deterministic integer factorization. We will generalize the sieve order to obtain polynomial-time reduction from factorization specific instance of multiple choice subset-sum problem. As an application, we improve upon special purpose algorithms integers composed divisors with small difference. In particular, refine runtime complexity Fermat's algorithm by large subexponential factor. Our procedure is deterministic, rigorous, easy implement and negligible space complexity. second heuristically faster than first, but non-negligible